Solving Polynomial Systems via Truncated Normal Forms
نویسندگان
چکیده
منابع مشابه
Stable normal forms for polynomial system solving
This paper describes and analyzes a method for computing border bases of a zero-dimensional ideal I . The criterion used in the computation involves specific commutation polynomials and leads to an algorithm and an implementation extending the one provided in [29]. This general border basis algorithm weakens the monomial ordering requirement for Gröbner bases computations. It is up to date the ...
متن کاملPolynomial and Linearized Normal Forms for Almost Periodic Differential Systems
For almost periodic differential systems ẋ = εf(x, t, ε) with x ∈ Cn, t ∈ R and ε > 0 small enough, we get a polynomial normal form in a neighborhood of a hyperbolic singular point of the system ẋ = ε limT→∞ 1 T ∫ T 0 f(x, t, 0) dt, if its eigenvalues are in the Poincaré domain. The normal form linearizes if the real part of the eigenvalues are non–resonant.
متن کاملSolving Systems of Polynomial
Current geometric and solid modeling systems use semi-algebraic sets for deening the boundaries of solid objects, curves and surfaces, geometric constraints with mating relationship in a mechanical assembly, physical contacts between objects, collision detection. It turns out that performing many of the geometric operations on the solid boundaries or interacting with geometric constraints is re...
متن کاملSolving parametric polynomial systems
We present a new algorithm for solving basic parametric constructible or semi-algebraic systems like C = {x ∈ C, p1(x) = 0, , ps(x) = 0, f1(x) 0, , fl(x) 0} or S = {x ∈ R, p1(x) = 0, , ps(x) = 0, f1(x)> 0, , fl(x)> 0}, where pi, fi ∈Q[U , X], U = [U1, , Ud] is the set of parameters and X = [Xd+1, , Xn] the set of unknowns. If ΠU denotes the canonical projection onto the parameter’s space, solvi...
متن کاملSolving polynomial systems via homotopy continuation and monodromy
We develop an algorithm to find all solutions of a generic system in a family of polynomial systems with parametric coefficients using numerical homotopy continuation and the action of the monodromy group. We argue that the expected number of homotopy paths that this algorithm needs to follow is roughly linear in the number of solutions. We demonstrate that our software implementation is compet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 2018
ISSN: 0895-4798,1095-7162
DOI: 10.1137/17m1162433